Distinguishing Sequences for Distributed Testing: Preset Distinguishing Sequences

Distinguishing Sequences for Distributed Testing: Adaptive Distinguishing Sequences

This paper concerns the problem of testing from a finite state machine (FSM) M modelling a system that interacts with its environment at multiple physically distributed interfaces, called ports. We assume that the distributed test architecture is used: there is a local tester at each port, the tester at port p only observes events at p, and the testers do not interact during testing. This paper...

Preset Distinguishing Sequences and Diameter of Transformation Semigroups

We investigate the length `(n, k) of a shortest preset distinguishing sequence (PDS) in the worst case for a k-element subset of an n-state Mealy automaton. It was mentioned by Sokolovskii [18] that this problem is closely related to the problem of finding the maximal subsemigroup diameter `(Tn) for the full transformation semigroup Tn of an n-element set. We prove that `(Tn) = 2 n exp{ √ n 2 l...

Distinguishing Sequences for Partially Specified FSMs

Distinguishing Sequences (DSs) are used in many Finite State Machine (FSM) based test techniques. Although Partially Specified FSMs (PSFSMs) generalise FSMs, the computational complexity of constructing Adaptive and Preset DSs (ADSs/PDSs) for PSFSMs has not been addressed. This paper shows that it is possible to check the existence of an ADS in polynomial time but the corresponding problem for ...

Distinguishing Proteins From Arbitrary Amino Acid Sequences

What kinds of amino acid sequences could possibly be protein sequences? From all existing databases that we can find, known proteins are only a small fraction of all possible combinations of amino acids. Beginning with Sanger's first detailed determination of a protein sequence in 1952, previous studies have focused on describing the structure of existing protein sequences in order to construct...

Automatic test generation using genetically-engineered distinguishing sequences